Checking Consistency of an ABox w.r.t. Global Assumptions in PDL
نویسندگان
چکیده
We reformulate Pratt’s tableau decision procedure of checking satisfiability of a set of formulas in PDL. Our formulation is simpler and more direct for implementation. Extending the method we give the first ExpTime (optimal) tableau decision procedure not based on transformation for checking consistency of an ABox w.r.t. a TBox in PDL (here, PDL is treated as a description logic). We also prove the new result that the data complexity of the instance checking problem in PDL is coNP-complete.
منابع مشابه
Optimal Tableau Decision Procedures for PDL
We reformulate Pratt’s tableau decision procedure of checking satisfiability of a set of formulas in PDL. Our formulation is simpler and more direct for implementation. Extending the method we give the first ExpTime (optimal) tableau decision procedure not based on transformation for checking consistency of an ABox w.r.t. a TBox in PDL (here, PDL is treated as a description logic). We also prov...
متن کاملImproving an RCC-Derived Geospatial Approximation by OWL Axioms
An approach to improve an RCC-derived geospatial approximation is presented which makes use of concept inclusion axioms in OWL. The algorithm used to control the approximation combines hypothesis testing with consistency checking provided by a knowledge representation system based on description logics. Propositions about the consistency of the refined ABox w.r.t. the associated TBox when compa...
متن کاملInconsistency-Tolerant Instance Checking in Tractable Description Logics
Research on inconsistency-tolerant query answering usually assumes that the terminological knowledge is correct, and only the facts (ABox) need to be repaired. In this paper we study the problem of answering instance queries over inconsistent ontologies, by repairing the whole knowledge base (KB). Contrary to ABox repairs, when KB repairs are considered, instance checking in DL-LiteHorn w.r.t. ...
متن کاملExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse
Grammar logics were introduced by Fariñas del Cerro and Penttonen in [7] and have been widely studied. In this paper we consider regular grammar logics with converse (REG logics) and present sound and complete tableau calculi for the general satisfiability problem of REG logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG logic. Using our calculi we develop ExpTime ...
متن کاملExpTime Tableaux with Global Caching for Hybrid PDL
We present the first direct tableau decision procedure with the ExpTime complexity for HPDL (Hybrid Propositional Dynamic Logic). It checks whether a given ABox (a finite set of assertions) in HPDL is satisfiable. Technically, it combines global caching with checking fulfillment of eventualities and dealing with nominals. Our procedure contains enough details for direct implementation and has b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 102 شماره
صفحات -
تاریخ انتشار 2010